A Semantic Interface for Logic Grammars
نویسندگان
چکیده
We introduce a semantic interface into logic grammars to give a natural link to the semantic component of natural language understanding systems. The semantic interface contains five parameters, i.e. input, semantic information, new devices, generator, and output. These parameters specify the procedure of compiling a desired semantic theory into its corresponding logic programs. The semantic interface can thus achieve a metalevel representation of required semantic theories using a meta-programming technique. We sketch how Montague semantics and discourse representation theory can be simulated in a logic-based natural language understanding system.
منابع مشابه
Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملConstraint-based RMRS Construction from Shallow Grammars
Semantic formalisms such as MRS [Copestake et al., 2003], UDRT [Reyle, 1993], or CLLS [Egg et al., 2001] provide elegant solutions for the treatment of semantic ambiguities in terms of underspecification. These semantic formalisms are not constrained to specific syntactic frameworks. MRS, for example, is mainly used with HPSG grammars, but may also be built from LFG grammars using co-descriptio...
متن کاملLearning Semantic Grammars with Constructive Inductive Logic Programming
Automating the construction of semantic grammars is a di cult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be viewed as the learning of search-control heuristics in a logic program. Appropriate control rules are learned using a new rst-order induction algorithm that automatically invents useful syntactic and semantic categories....
متن کاملModular Logic Grammars
This report describes a logic grammar formalism, Modular Logic Grammars, exhibiting a high degree of modularity between syntax and semantics. There is a syntax rule compiler (compiling into Prolog) which takes care of the building of analysis structures and the interface to a clearly separated semantic interpretation component dealing with scoping and the construction of logical forms. The whol...
متن کاملLearning Semantic Grammars with Constructive nduct ive ogic
Automating the construction of semantic grammars is a difficult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be viewed as the learning of search-control heuristics in a logic program. Appropriate control rules are learned using a new first-order induction algorithm that automatically invents useful syntactic and semantic categor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013